Directed Graph Embedding
نویسندگان
چکیده
In this paper, we propose the Directed Graph Embedding (DGE) method that embeds vertices on a directed graph into a vector space by considering the link structure of graphs. The basic idea is to preserve the locality property of vertices on a directed graph in the embedded space. We use the transition probability together with the stationary distribution of Markov random walks to measure such locality property. It turns out that by exploring the directed links of the graph using random walks, we can get an optimal embedding on the vector space that preserves the local affinity which is inherent in the directed graph. Experiments on both synthetic data and real-world Web page data are considered. The application of our method to Web page classification problems gets a significant improvement comparing with state-of-art methods.
منابع مشابه
Directed prime graph of non-commutative ring
Prime graph of a ring R is a graph whose vertex set is the whole set R any any two elements $x$ and $y$ of $R$ are adjacent in the graph if and only if $xRy = 0$ or $yRx = 0$. Prime graph of a ring is denoted by $PG(R)$. Directed prime graphs for non-commutative rings and connectivity in the graph are studied in the present paper. The diameter and girth of this graph are also studied in the pa...
متن کاملAF Embedding of Crossed Products of Certain Graph C-Algebras by Quasi-free Actions
We introduce the labelling map and the quasi-free action of a locally compact abelian group on a graph C∗-algebra of a row-finite directed graph. Some necessary conditions for embedding the crossed product to an AF algebra are discussed, and one sufficient condition is proved that if the row-finite directed graph is constructed by possibly attaching some 1-loops to a row-finite directed graph w...
متن کاملEstimating Vector Fields on Manifolds and the Embedding of Directed Graphs
This paper considers the problem of embedding directed graphs in Euclidean space while retaining directional information. We model a directed graph as a finite set of observations from a diffusion on a manifold endowed with a vector field. This is the first generative model of its kind for directed graphs. We introduce a graph embedding algorithm that estimates all three features of this model:...
متن کاملEntropic Graph Embedding via Multivariate Degree Distributions
Although there are many existing alternative methods for using structural characterizations of undirected graphs for embedding, clustering and classification problems, there is relatively little literature aimed at dealing with such problems for directed graphs. In this paper we present a novel method for characterizing graph structure that can be used to embed directed graphs into a feature sp...
متن کاملEnumeration of digraph embeddings
A cellular embedding of an Eulerian digraph D into a closed surface is said to be directed if the boundary of each face is a directed closed walk in D. The directed genus polynomial of an Eulerian digraph D is the polynomial ΓD(x) = ∑ h≥0 gh(D)x h where gh(D) is the number of directed embeddings into the orientable surface Sh, of genus h, for h = 0, 1, . . . . The sequence {gh(D)|h ≥ 0}, which ...
متن کامل